package leetcode.秋招.不过是360;

import java.util.Arrays;
import java.util.Scanner;

/**
 * @author ：zsy
 * @date ：Created 2021/8/29 16:00
 * @description：
 */
public class Main {
    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
        int n = in.nextInt();
        int p = in.nextInt();
        int q = in.nextInt();
        int[] nums = new int[n];
        for (int i = 0; i < nums.length; i++) {
            nums[i] = in.nextInt();
        }
        Arrays.sort(nums);
        int count = 0;
        int normalScore = 100;
        int pre = nums[nums.length - 1];
        for (int i = nums.length - 1; i >= 0; i--) {
            if (nums[i] != pre) {
                normalScore--;
                pre = nums[i];
            }
            if ((p * normalScore + q * nums[i]) / 100 >= 60) {
                count++;
            }
        }
        System.out.println(count);
    }
}
